Using heuristic search for finding deadlocks in concurrent systems
نویسندگان
چکیده
منابع مشابه
Detecting Deadlocks in Concurrent Systems
We use a geometric description for deadlocks occuring in scheduling problems for concurrent systems to construct a partial order and hence a directed graph, in which the local maxima correspond to deadlocks. Algorithms finding deadlocks are described and assessed.
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملFinding Prediction Models by Heuristic Search
Prediction models are of increasing importance in our society. Based on historical observations, one wants to design a model based on these observations to predict future behavior. The aim of this paper is to show that we can produce good prediction models by the use of Heuristic Search guided Column Generation in a Goal Programming framework. Statistic Norway (SSB) have designed a model to pre...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولFinding and Exploiting LTL Trajectory Constraints in Heuristic Search
We suggest the use of linear temporal logic (LTL) for expressing declarative information about optimal solutions of search problems. We describe a general framework that associates LTLf formulas with search nodes in a heuristic search algorithm. Compared to previous approaches that integrate specific kinds of path information like landmarks into heuristic search, the approach is general, easy t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2005
ISSN: 0890-5401
DOI: 10.1016/j.ic.2005.07.004